Vizing's 2-Factor Conjecture Involving Toughness and Maximum Degree Conditions
نویسندگان
چکیده
منابع مشابه
Vizing's 2-Factor Conjecture Involving Large Maximum Degree
Let G be a simple graph of order n, and let ∆(G) and χ′(G) denote the maximum degree and chromatic index of G, respectively. Vizing proved that χ′(G) = ∆(G) or ∆(G) + 1. Following this result, G is called edge-chromatic critical if χ′(G) = ∆(G) + 1 and χ′(G − e) = ∆(G) for every e ∈ E(G). In 1968, Vizing conjectured that if G is edge-chromatic critical, then the independence number α(G) ≤ n/2, ...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملGallai's path decomposition conjecture for graphs of small maximum degree
Gallai’s path decomposition conjecture states that the edges of any connected graph on n vertices can be decomposed into at most n+1 2 paths. We confirm that conjecture for all graphs with maximum degree at most five.
متن کاملDegree conditions for 2-factors
For any positive integer k, we investigate degree conditions implying that a graph G of order n contains a 2-factor with exactly k components (vertex disjoint cycles). In particular, we prove that for k ≤ (n/4), Ore's classical condition for a graph to be hamiltonian (k = 1) implies that the graph contains a 2-factor with exactly k components. We also obtain a sufficient degree condition for a ...
متن کاملMaximum degree in graphs of diameter 2
The purpose of this paper is to prove that, with the exception of C 4 , there are no graphs of diameter 2 and maximum degree d with d 2 vertices . On one hand our paper is an extension of [4] where it was proved that there are at most four Moore graphs of diameter 2 (i .e . graphs of diameter 2, maximum degree d, and d2 + 1 vertices) . We also use the eigenvalue method developed in that paper ....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/7353